Symbolic Exploration of transition Hierarchies
نویسندگان
چکیده
In formal design verification, successful model checking is typically preceded by a laborious manual process of constructing design abstractions. We present a methodology for partially and in some cases, fully bypassing the abstraction process. For this purpose, we provide to the designer abstraction operators which, if used judiciously in the description of a design, structure the corresponding state space hierarchically. This structure can then be exploited by verification tools, and makes possible the automatic and exhaustive exploration of state spaces that would otherwise be out of scope for existing model checkers. Specifically, we present the following contributions: A temporal abstraction operator that aggregates transitions and hides intermediate steps. Mathematically, our abstraction operator is a function that maps a flat transition system into a two-level hierarchy where each atomic upper-level transition expands into an entire lower-level transition system. For example, an arithmetic operation may expand to a sequence of bit operations. A BDD-based algorithm for the symbolic exploration of multi-level hierarchies of transition systems. The algorithm traverses a level-n transition by expanding the corresponding level-(n-1) transition system on-thefly. The level-n successors of a state are determined by computing a level-(n-1) reach set, which is then immediately released from memory. In this fashion, we can exhaustively explore hierarchically structured state spaces whose flat counterparts cause memory overflows. We experimentally demonstrate the efficiency of our method with three examples a multiplier, a cache coherence protocol, and a multiprocessor system. In the first two examples, we obtain significant improvements in run times and peak BDD sizes over traditional state-space search. The third example cannot be model checked at all using conventional methods (without manual abstractions), but can be analyzed fully automatically using transition hierarchies. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-98-13. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/105 !" # $ &%' ( ) (*!,+ .0/2131046587:9<;>=2= ?A@ BDC .FE 5HG IJ10K L0MNK OD10;>=2=2= P"; M:;2.FC&Q GR.0/0.,C .,K MTS U VXW2Y2Z0[]\FY_^a`>bdcTegf#h ikjml]n2oqpsr_b6t_n2fqpvuxw0i0yqpse_b zRo#{]w2w2n2o#oqc|{,j}haeFlDn jXw ~Dn2w _psb]rdpso yqFFpsw0ikjvjs ]f#n2w2n2l]n2l Fai$j:i0"e_fqpseg{Doh i3bF{xikjm]f#eFw2n2o#o e0cmw2e_b]o#y#f#{DwyqpsbDral]n2oqpsrgb i0Do#y#f i0w2yqpse_b]o2 "6n ]f#n2o#n2bFyi han2y#~]eFlDe0jse_r_cTegf8xi3f#yqp:i2jvjs_i3b]lpsbo#eghan w0i3o#no2zRcT{Fjvjs_FFxi3o#oqp:b]ry#~]n i3]o#y#f i3wyqpse_b]f#eFw2n2o#o2 Degf8y#~Fpso D{]f#"ego#n_z* n Df#e0t_psl]ny#e y#~]n lDn2oqpsrgbDnf i0Do#y#f i0w2yqpse_b e_xn2f i3y#egf#o$ ~Fpsw ~ zFpvcX{]o#n2l8{DlFpsw pse_{]oqjs psb y#~]n l]n2o#w2fqps]yqpse_b6e3c}iAlDnoqpsr_b z"o#y#f#{]w2y#{Df#nAy#~]n w2egf#f#n2o#"e_b]lFpsbDr o#y i3y#n o#xi3wn ~,psnf i3f#w ~,psw0i2jvjNg D ~Fpso o#y#f#{]w2y#{]f#n w0i0b8y#~]n2b "n n2FFjse3psy#n2l F t_nfqpvu"w0i0yqpse_by#eFe0jso2z"i0bDl h i0_n2o"e_o#oqpsFjsn8y#~]ni3{]y#e_h i0yqpsw i3b]l n2F~"i0{Do#yqpstgn8nF,jsegf i3yqpse_b e3co#y i3y#n o#"i0w2n2o*y#~"i0y e_{Fjsldegy#~Dnf# pso#n"n e_{]y e0c o#w2eg"n$cTegfXn2_pso#yqpsb]rahaeFl]n j w ~Dn2w _nf#o2 F"n2w pvuxw0ikjvjsgzX n ]f#n2o#n2bFyy#~Dn c|e3jvjse0 psbDrHw2e_bFy#fqps]{DyqpsegbDo2 y#n2ha"egf ikj i3]o#y#f i3w2yqpsegbe_xn2f i3y#egfAy#~"i0y i3r_rgf#n2rFi0y#n2oAy#f i3b]oqpsyqpse_b]o i0bDl6~,psl]n2oApsb, y#n2f#hanl,p:i0y#n o#y#n2]o2 i0y#~Dnh i3yqpsw0i2jvjs_ze_{]fi3]o#y#f i3wyqpse_be_xn2f i3y#egfdpsoHicT{]bDwyqpse_b y#~xi3yah i0DoHi i0yay#f i3b]oqpsyqpse_bo#Fo#y#nh psbFy#e¡iyq e0Tjsn2t_n j~Fpsn2f i3f#w ~F ~]n2f#n nki3w ~ i3y#egh8psw {D]"n2fqTjsn2tgn j y#f i0bDoqpsyqpsegbn2Fxi3b]lDoApsbFy#e6i3b6n2bFyqpsf#najse0 n2fqTjsn2tgn j y#f i3b]oqpsyqpse_b o#Fo#y#n2h De_f n2]i0haFjsn_zmi3b6i0fqpsy#~Dhanyqpswae_"nf i3yqpse_bh¢ikHn2Fxi3b]l psbFy#e i o#n2£F{DnbDw2n e3c*Fpsy eg"n2f i0yqpse_b]o2 ¥¤ ¦¦ >xi3o#n2l6i2jsr_e_fqpsy#~]h§cTe_fy#~Dn o#Fh8xe3jvpswan2FFjse_f i0yqpse_be0cXh {,jsyqpvTjsn2tgn j~,psn2f i0fq w ~,psn2oe3c*y#f i0bDoqpsyqpsegbo#Fo#y#n2hao2 x$~]n ikjsrge_fqpsy#~]h y#f iktgn2f#o#n2o ̈iJjsn2t_n jv#©6y#f i3b]oqpsyqpse_bF n2Fxi3b]l,psb]r y#~Dnw2e_f#f#no#"e_b]l,psb]rdjsnt_n jv a>©J«6¬0*y#f i3b]oqpsyqpse_bo#Fo#y#n2he_bFqy#~]n Tx_ ]$~]n jsn2tgn jv©o#{Dw2wn2o#o#e_f#oae0c ̈i o#y i3y#nHi3f#n l]n2y#n2f#h8psb]n2l¡F we_ha]{Dyqpsb]r¡idjsn2tgn jv a>© «¬0 f#n0i0w ~ o#n2y2zF ~Fpsw ~apso y#~]n2bapshahanl,p:i0y#n js f#n jsnki3o#n2lacTf#egh'han2he_f#_ F`>bay#~Fpso c>i3o#~Fpse_b z nHw0i3b®n2F~"i0{Do#yqpstgn js ̄n2F,jsegf#n ~Fpsn2f i0f#w ~Fpsw0ikjvj:o#y#f#{]w2y#{Df#nlo#y i3y#no#xi3w2n2o ~]e_o#n i3y w2e_{]bFy#n2f#xi3f#y#oAw0i0{Do#nAhn2hae_f#He0t_n2fqxe0$o2 6n n2Fxn2fqpshan2bFy i2jvjs lDnhae_b]o#y#f i3y#n6y#~Dn6n ° w psn2bDwe3c e_{]f hn2y#~DeFl psy#~y#~]f#n2n n2]i0ha,jsnoqi6h8{Fjsyqps,jvpsnf2z i w0i0w ~]n w2e_~]n2f#n2b]w2n Df#egy#eFw2e3jTzi0bDl¡i h {FjsyqpsDf#eFw2no#o#e_f o#Fo#y#n2h *`>by#~Dn u"f#o#yyq en2]i0haFjsn2o2z n egDy i2psboqpsr_bFpvuxw0i3bFy pshaDf#e0tgn2han2bFy#oapsb f#{]b±yqpshano6i3b]l±"nki3 ¤ ¦¦ oqps22n2o6e0t_n2fHy#f i3lFpsyqpse_bxikjHo#y i3y#n qo#xi3wno#n0i3f#w ~ $~]n y#~Fpsf#l n2]i0haFjsnaw0i3b]b]e_yA"n haeFl]n j*w ~]n2w _n2l i3yi2jvj*{Doqpsb]rw2e_bFtgn2bFyqpse_bxikjhan2y#~]eFl]o aT psy#~Deg{Dyh¢i3bF{xikj¢i3]o#y#f i3w2yqpsegbDo zD{]yw0i0b"n¡i3bxikjsF2n2l±cT{Fjvjs ̄i3{]y#e_h i0yqpsw0ikjvjs {]oqpsbDrHy#f i3b]oqpsyqpse_b6~,psn2f i0f#w ~Fpsn2o2
منابع مشابه
Symbolic Exploration of Transition Hierarchies y
In formal design veri cation, successful model checking is typically preceded by a laborious manual process of constructing design abstractions. We present a methodology for partially| and in some cases, fully|bypassing the abstraction process. For this purpose, we provide to the designer abstraction operators which, if used judiciously in the description of a design, structure the correspondin...
متن کاملDesign Assistance in Concurrent Integrated Environments
This paper presents a design assistance framework for online design process monitoring and design space exploration in concurrent integrated environments. The approach is based on an extension of Predicate Transition Nets as a modelling paradigm. This modelling paradigm provides a formal semantics for the concurrent behaviour of design processes. The presented approach allows the exploration of...
متن کاملAssessing Identity Change: A Longitudinal Study of the Transition from School to College
The impact of a major life transition on identity change is examined in this longitudinal study. Drawing on a framework provided by symbolic interactionism and identity theory (Stryker, 1968, 1987), we examined global self-esteem, interactional commitment and the identity hierarchies of a group of students while they were in secondary school and, again one year later, when they had made the tra...
متن کاملIntegrating Symmetries and Symbolic Enabling Test for Efficient Simulation of SWNs
(Stochastic) Colored Petri Nets are a formalism widely used to specify and analyze distributed discrete-event systems. Determining the set of transition color instances enabled in a given marking is a basic task affecting analysis techniques based on state-space exploration, model-checking, and especially discreteevent simulation (the latter is an interesting alternative when analytical solutio...
متن کاملA Tool for Practical Reasoning about State Machine Designs
Critical systems (e.g. safety-critical and security-critical systems) need the highest levels of assurance. The eeective engineering design of critical systems still lacks easy-to-use, practical and above-all trustworthy tools which allow the exploration of possible design strategies, and support formal reasoning about their critical properties. In this paper, we describe the Veracity prototype...
متن کاملSymbolic Computation of Minimal Probabilistic Reachability∗
This paper continues our study of the verification problem for infinitestate systems featuring both nondeterministic and probabilistic choice. In an earlier paper we defined symbolic probabilistic systems, an extension of the framework of symbolic transition systems due to Henzinger et. al., and considered the problem of deciding the maximal probability of reaching a set of target states. A sym...
متن کامل